Twin Vertices in Hypergraphs
نویسندگان
چکیده
منابع مشابه
Twin Vertices in Hypergraphs
Twin vertices in graphs correspond to vertices sharing the same neighborhood. We propose an extension to hypergraphs of the concept of twin vertices. For this we give two characterizations of twin vertices in hypergraphs, a first one in term of clone vertices (the concept of clone has been introduced in [16]) and a second one in term of committees (introduced in [6]). Finally we give an algorit...
متن کاملComputing the Vertices of Tropical Polyhedra Using Directed Hypergraphs
We establish a characterization of the vertices of a tropical polyhedron defined as the intersection of finitely many half-spaces. We show that a point is a vertex if, and only if, a directed hypergraph, constructed from the subdifferentials of the active constraints at this point, admits a unique strongly connected component that is maximal with respect to the reachability relation (all the ot...
متن کاملFrom copair hypergraphs to median graphs with latent vertices
The purpose of this paper is to extend the Buneman construction of partially labelled trees to the general case. This extension is related with the characterization of median graphs by Mulder and Schrijver. In the first section, we construct a graph G(H) associated with a copair hypergraph H on a finite set X and define the notion of a median graph with latent vertices (called X-median graph). ...
متن کاملThe minimum number of vertices in uniform hypergraphs with given domination number
The domination number γ(H) of a hypergraph H = (V (H), E(H)) is the minimum size of a subset D ⊂ V (H) of the vertices such that for every v ∈ V (H) \D there exist a vertex d ∈ D and an edge H ∈ E(H) with v, d ∈ H. We address the problem of finding the minimum number n(k, γ) of vertices that a k-uniform hypergraph H can have if γ(H) ≥ γ and H does not contain isolated vertices. We prove that n(...
متن کاملCritical Random Hypergraphs: the Emergence of a Giant Set of Identifiable Vertices by Christina Goldschmidt
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase transition takes various forms, depending on the values of the parameters controlling the different types of hyperedges. It may be continuous as in a random graph. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2006
ISSN: 1571-0653
DOI: 10.1016/j.endm.2006.08.069